Impact of memory size on graph exploration capability

نویسندگان

  • Pierre Fraigniaud
  • David Ilcinkas
  • Andrzej Pelc
چکیده

A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) influence its exploration capability? In particular, does every increase of the memory size enable an agent to explore more graphs? We give a partial answer to this problem by showing that a strict gain of the exploration power can be obtained by a polynomial increase of the number of states. We also show that, for automata with few states, the increase of memory by even one state results in the capability of exploring more graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Memory Efficient Anonymous Graph Exploration

Efficient exploration of unknown or unmapped environments has become one of the fundamental problem domains in algorithm design. Its applications range from robot navigation in hazardous environments to rigorous searching, indexing and analysing digital data available on the Internet. A large number of exploration algorithms has been proposed under various assumptions about the capability of mo...

متن کامل

G-SQL: Fast Query Processing via Graph Exploration

A lot of real-life data are of graph nature. However, it is not until recently that business begins to exploit data’s connectedness for business insights. On the other hand, RDBMSs are a mature technology for data management, but they are not for graph processing. Take graph traversal, a common graph operation for example, it heavily relies on a graph primitive that accesses a given node’s neig...

متن کامل

Digraphs Exploration with Little Memory

Under the robot model, we show that a robot needsΩ(n log d) bits of memory to perform exploration of digraphs with n nodes and maximum out-degree d. We then describe an algorithm that allows exploration of any n-node digraph with maximum out-degree d to be accomplished by a robot with a memory of size O(nd logn) bits. Under the agent model, we show that digraph exploration cannot be achieved by...

متن کامل

Effect of Alumina Nanoparticles on the Enhancement of Shape Memory, Mechanical and Impact Properties of TPU/ABS blend

In this paper, the shape memory, mechanical and Izod impact properties of a new shape memory nanocomposite based on thermoplastic polyurethane (TPU), acrylonitrile butadiene styrene (ABS) and alumina nanoparticles were investigated. The morphological results showed that the presence of 1% alumina nanoparticles made a reduction in diameter of ABS domains and caused a uniform distribution of the ...

متن کامل

Memory Design and Exploration for Low Power Embedded Systems

In embedded system design, the designer has to choose an on-chip memory configuration that is suitable for a specific application. To aid in this design choice, we present a memory exploration procedure based on three performance metrics, namely, cache size, the number of processor cycles and the energy consumption. We show the importance of including energy in the performance metrics, since an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 156  شماره 

صفحات  -

تاریخ انتشار 2008